Simulation of large interconnect structures using ILU-type preconditioner

نویسنده

  • D. Harutyunyan
چکیده

For a fast simulation of interconnect structures we consider preconditioned iterative solution methods for large complex valued linear systems. In many applications the discretized equations result in ill-conditioned matrices, and efficient preconditioners are indispensable to solve the linear systems accurately. We apply the dual threshold incomplete LU (ILUT) factorization as preconditioners for the BICGSTAB iterative solver. On complicated problems with a different range of frequencies we show that the BICGSTAB method with the ILUT preconditioner provides a very accurate solution of the linear systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory

ILU(k) is an important preconditioner widely used in many linear algebra solvers for sparse matrices. Unfortunately, there is still no highly scalable parallel ILU(k) algorithm. This paper presents the first such scalable algorithm. For example, the new algorithm achieves 50 times speedup with 80 nodes for general sparse matrices of dimension 160,000 that are diagonally dominant. The algorithm ...

متن کامل

A Cost-effective Ilu Preconditioner for Weather Simulation

To date, the most efficient solver used in the weather sciences for the resolution of linear system in numerical weather prediction is the generalized minimal residual method called GMRES. However, difficulties still appear in matrix resolution when the GMRES iterative method is used without an appropriate preconditioner. For improving the computation speed in numerically solving weather equati...

متن کامل

Scalable Task-Oriented Parallelism for Structure Based Incomplete LU Factorization

ILU(k) is an important preconditioner widely used in many linear algebra solvers for sparse matrices. Unfortunately, there is still no highly scalable parallel ILU(k) algorithm. This paper presents the first such scalable algorithm. For example, the new algorithm achieves 50 times speedup with 80 nodes for general sparse matrices of dimension 160,000 that are diagonally dominant. The algorithm ...

متن کامل

On the Scalability of the Albany/FELIX first-order Stokes Approximation ice Sheet Solver for Large-Scale Simulations of the Greenland and Antarctic ice Sheets

We examine the scalability of the recently developed Albany/FELIX finite-element based code for the first-order Stokes momentum balance equations for ice flow. We focus our analysis on the performance of two possible preconditioners for the iterative solution of the sparse linear systems that arise from the discretization of the governing equations: (1) a preconditioner based on the incomplete ...

متن کامل

A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices

A dual reordering strategy based on both threshold and graph reorderings is introduced to construct robust incomplete LU (ILU) factorization of indefinite matrices. The ILU matrix is constructed as a preconditioner for the original matrix to be used in a preconditioned iterative scheme. The matrix is first divided into two parts according to a threshold parameter to control diagonal dominance. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008